Triangulating Surfaces with Bounded Energy

نویسندگان

چکیده

Abstract We show that if a closed Lipschitz surface in $${\mathbb {R}}^n$$ R n has bounded Kolasinski–Menger energy, then it can be triangulated with triangles whose number is by the energy and area. Each of an image subset plane under diffeomorphism distortion $$\sqrt{2}$$ 2 .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triangulating with High Connectivity

We consider the problem of triangulating a given point set, using straight-line edges, so that the resulting graph is \highly connected." Since the resulting graph is planar, it can be at most 5-connected. Under the nondegeneracy assumption that no three points are collinear, we characterize the point sets with three vertices on the convex hull that admit 4-connected triangulations. More genera...

متن کامل

Online Deadline Scheduling with Bounded Energy Efficiency

Existing work on scheduling with energy concern has focused on minimizing the energy for completing all jobs or achieving maximum throughput [19, 2, 7, 13, 14]. That is, energy usage is a secondary concern when compared to throughput and the schedules targeted may be very poor in energy efficiency. In this paper, we attempt to put energy efficiency as the primary concern and study how to maximi...

متن کامل

Triangulating Point Clouds with Spherical Topology

Triangulating a set of scattered 3D points is a common approach to surface reconstruction from unorganized point clouds. Besides several Voronoi-based and incremental algorithms, a recently presented technique parameterizes the sample points and uses a Delaunay triangulation of the parameter points in the parameter domain. This method is limited to reconstructing surfaces that are homeomorphic ...

متن کامل

Triangulating Smooth Submanifolds with Light Scaffolding

We propose an algorithm to sample and mesh a k-submanifold M of positive reach embedded in R. The algorithm first constructs a crude sample of M. It then refines the sample according to a prescribed parameter ε, and builds a mesh that approximates M. Differently from most algorithms that have been developped for meshing surfaces of R, the refinement phase does not rely on a subdivision of R (su...

متن کامل

Bifurcations of Random Differential Equations with Bounded Noise on Surfaces.

In random differential equations with bounded noise minimal forward invariant (MFI) sets play a central role since they support stationary measures. We study the stability and possible bifurcations of MFI sets. In dimensions 1 and 2 we classify all minimal forward invariant sets and their codimension one bifurcations in bounded noise random differential equations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Geometric Analysis

سال: 2022

ISSN: ['1559-002X', '1050-6926']

DOI: https://doi.org/10.1007/s12220-022-00992-2